Hardware Architecture for Fractal Image Encoder with Quadtree Partitioning
نویسندگان
چکیده
This paper presents the hardware architecture for fractal image compression (FIC) with quadtree partitioning. Fractal image coding with quadtree partitioning allows one to produce higher quality of image. Processing image areas of different complexity with image blocks of varying size enables proper exploration of image details. Additionally, exploiting parallelism present within the algorithm and adopting hardware based solutions speed up the encoding
منابع مشابه
FPGA Implementation of Quadtree Partitioning Iterated Function Systems Applied to Medical Images
Owing to the growth of technology there is a need for high performance and high capacity systems to efficiently utilize the bandwidth during transmission of images. Hence Compression of medical Images is required for data storage and transmission. One such compression algorithms which is found effective for medical images is fractal image compression. Fractal image compression (FIC) is a lossy ...
متن کاملA Parallel Architecture for Quadtree-based Fractal Image Coding
This paper proposes a parallel architecture for quadtreebased fractal image coding. This architecture is capable of performing the fractal image coding based on quadtree partitioning without the external memory for the fixed domain pool. Since a large domain block consists of small domain blocks, the calculations of distortion for all kinds of domain blocks are performed by the summation of the...
متن کاملFractal Compression
We explain, in detail, the theory of Fractal Compression introduced by Barnsley and extended by Jacquin. We begin by brieey discussing metric spaces, leading to contrac-tive mappings and their xed points. Then, IFS and Local IFS are introduced. These concepts form the basic underlying theory of Fractal Compression. We then discuss our implementation of the theory and the results of our eeort. O...
متن کاملAn Alternating Binary-tree Partitioning for Fractal Image Coding
The fractal coding algorithm partitions the original image into a number of blocks. Then each block is coded by obtaining the information of the contractive transformations for the block. There are many methods of partitioning an image based on squares and rectangles such as xed-size partitioning, quad-tree partitioning, and HV partitioning. In this paper, we propose an alternating binary-tree ...
متن کاملAccelerated Analysis of Quad-trees in the Ezw Algorithm
Abstract. In this paper, a novel scheme for the analysis of quad-trees in the discrete wavelet spectrum of a digital image is proposed. The scheme can be successfully applied to any zero-tree based image encoder, such as the embedded zero-tree wavelet (EZW) algorithm of Shapiro and set partitioning in hierarchical trees (SPIHT) by Said and Pearlman. Exceptionally high performance of the propose...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016